منابع مشابه
Reticulation-Visible Networks
Let X be a finite set, N be a reticulation-visible network on X, and T be a rooted binary phylogenetic tree. We show that there is a polynomial-time algorithm for deciding whether or not N displays T . Furthermore, for all |X| ≥ 1, we show that N has at most 8|X| − 7 vertices in total and at most 3|X| − 3 reticulation vertices, and that these upper bounds are sharp.
متن کاملA decomposition theorem and two algorithms for reticulation-visible networks
In studies of molecular evolution, phylogenetic trees are rooted binary trees, whereas phylogenetic networks are rooted acyclic digraphs. Edges are directed away from the root and leaves are uniquely labeled with taxa in phylogenetic networks. For the purpose of validating evolutionary models, biologists check whether or not a phylogenetic tree (resp. cluster) is contained in a phylogenetic net...
متن کاملSolving Tree Containment Problem for Reticulation-visible Networks with Optimal Running Time
Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in the class of binary network. Recently, it was proven to be solvable in cubic time, and later in quadratic time for the class of general reticulation visible...
متن کاملLocating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time
In phylogenetics, phylogenetic trees are rooted binary trees, whereas phylogenetic networks are rooted arbitrary acyclic digraphs. Edges are directed away from the root and leaves are uniquely labeled with taxa in phylogenetic networks. For the purpose of validating evolutionary models, biologists check whether or not a phylogenetic tree is contained in a phylogenetic network on the same taxa. ...
متن کاملReticulation in Evolution
Molecular phylogenetics, the study of reconstructing evolutionary trees, is a well-established field of scientific endeavor. However, in certain circumstances evolution is not completely tree-like. For example, a comparison of gene trees representing a set of present-day species and reconstructed for different genetic loci often reveals conflicting tree topologies. These discrepancies are not a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2016
ISSN: 0196-8858
DOI: 10.1016/j.aam.2016.04.004